Analysis by Reduction of D-trees
نویسنده
چکیده
The goal of this study is to introduce and observe analysis by reduction of dependency trees. We focus on formalization of certain minimalistic properties of analysis by reduction of dependency trees, and its complexity issues.
منابع مشابه
Analysis of the physiological responses of the plane and willow trees against air pollution in Tehran .
Trees can improve air quality, but at the same time, pollution might put them at risk. Plane(Platanus orientalis L) and willow trees (Salix babylonicaL) are important trees in the green space of Tehran. Plane trees in Tehran have experienced early autumn in recent years due to severe air pollution. The present study, investigated some physiological traits of these trees under study to determine...
متن کاملارزیابی برهمکنش درون گونه‌ای درختان شیشم (Dalbergia sissoo Roxb.) در ذخیره‌گاه شیشم استان خوزستان
Positive and negative (facilitative and competitive) interactions of plants are important issues in autecology and can be evaluated by the spatial pattern analysis in plant ecosystems. This study investigates the intraspecific interactions of Indian rosewood (Dalbergia sissoo Roxb.) trees in Indian rosewood Reserve of Khuzestan province. Three 150 m × 200 m plots were selected and the spatial l...
متن کاملThe Role of Trees in Absorption, Control and Reduction of Acoustic Pollution "Based on a Scientific Commentary of the Fourth Verse of Munafiqun Surah"
Scientific miracle is one of the aspects of miracle in the Holy Quran. The Holy Quran includes verses referring to scientific fact, those proved by development of human knowledge and scientific equipments after passing 14 centuries from the revelation of the Quran. The verse 4 of Munafiqun verse: "as though they were blocks of wood in striped cloaks" is among those verses which, based on a spec...
متن کاملLeap Zagreb indices of trees and unicyclic graphs
By d(v|G) and d_2(v|G) are denoted the number of first and second neighborsof the vertex v of the graph G. The first, second, and third leap Zagreb indicesof G are defined asLM_1(G) = sum_{v in V(G)} d_2(v|G)^2, LM_2(G) = sum_{uv in E(G)} d_2(u|G) d_2(v|G),and LM_3(G) = sum_{v in V(G)} d(v|G) d_2(v|G), respectively. In this paper, we generalizethe results of Naji et al. [Commun. Combin. Optim. ...
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014